Unified Compression-Based Acceleration of Edit-Distance Computation
نویسندگان
چکیده
منابع مشابه
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming solution for this problem computes the edit-distance between a pair of strings of total length O(N) in O(N) time. To this date, this quadratic upperbound has never been substantially improved for general strings. Howev...
متن کاملHomomorphic Computation of Edit Distance
These days genomic sequence analysis provides a key way of understanding the biology of an organism. However, since these sequences contain much private information, it can be very dangerous to reveal any part of them. It is desirable to protect this sensitive information when performing sequence analysis in public. As a first step in this direction, we present a method to perform the edit dist...
متن کاملEdit Distance and its Computation
In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi’s Regularity Lemma directly. Using this new method, we are able to compute the edit distance from hereditary properties for which it was previously unknown. For some graphs H, the edit ...
متن کاملComputation of Normalized Edit Distance and Applications
Given two strings X and Y over a finite alphabet, the normalized edit distance between X and Y, d( X , Y ) is defined as the minimum of W ( P ) / L ( P ) , where P is an editing path between X and Y , W ( P ) is the sum of the weights of the elementary edit operations of P, and L ( P ) is the number of these operations (length of P). In this paper, it is shown that in general, d ( X , Y ) canno...
متن کاملFast Computation of Graph Edit Distance
The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbacks including oversized search space, huge memory consumption, and lots of expensive backtracking. In this paper, we present BSS GED, a novel vertex-based mapping method for the GED computation. First, we create a smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9590-6